A combinatorial particle swarm optimisation for solving permutation flowshop problems
نویسندگان
چکیده
The m-machine permutation flowshop problem PFSP with the objectives of minimizing the makespan and the total flowtime is a common scheduling problem, which is known to be NP-complete in the strong sense, when m P 3. This work proposes a new algorithm for solving the permutation FSP, namely combinatorial Particle Swarm Optimization. Furthermore, we incorporate in this heuristic an improvement procedure based on the simulated annealing approach. The proposed algorithm was applied to well-known benchmark problems and compared with several competing metaheuristics. 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
Hybrid Genetic Algorithm with PSO Effect for Combinatorial Optimisation Problems
In engineering field, many problems are hard to solve in some definite interval of time. These problems known as “combinatorial optimisation problems” are of the category NP. These problems are easy to solve in some polynomial time when input size is small but as input size grows problems become toughest to solve in some definite interval of time. Long known conventional methods are not able to...
متن کاملA hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem
In this paper we propose PSO–EDA, a hybrid particle swarm optimization (PSO) with estimation of distribution algorithm (EDA) to solve permutation flowshop scheduling problem (PFSP). PFSP is an NP-complete problem, for which PSO was recently applied. The social cognition in the metaphor of canonical PSO is incomplete, since information conveyed in the non-gbest particles is lost. Also, the intel...
متن کاملTabu Search with two approaches to parallel flowshop evaluation on CUDA platform
The introduction of NVidia’s powerful Tesla GPU hardware and Compute Unified Device Architecture (CUDA) platform enable many-core parallel programming. As a result, existing algorithms implemented on a GPU can run many times faster than on modern CPUs. Relatively little research has been done so far on GPU implementations of discrete optimisation algorithms. In this paper, two approaches to par...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملSolving Flowshop Scheduling Problems Using a Discrete African Wild Dog Algorithm
The problem of m-machine permutation flowshop scheduling is considered in this paper. The objective is to minimize the makespan. The flowshop scheduling problem is a typical combinatorial optimization problem and has been proved to be strongly NP-hard. Hence, several heuristics and meta-heuristics were addressed by the researchers. In this paper, a discrete African wild dog algorithm is applied...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Industrial Engineering
دوره 54 شماره
صفحات -
تاریخ انتشار 2008